In a natural language query system (e.g., RENDEZVOUS) for a relational data base, a problem often arises that: the user's query may be translated into an incomplete formal (e.g, DEDUCE) query due to errors, ambiguities or incompleteness in the user's query, or due to the limitations of the natural language analyzer. This paper considers specifically joins which are missing from the incomplete formal query, and proposes an algorithm based on minimal spanning trees for solving this problem.
By: C. L. Chang
Published in: RJ2145 in 1978
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .